Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
app(f,a) |
→ app(f,b) |
| 2: |
|
app(g,b) |
→ app(g,a) |
|
There are 2 dependency pairs:
|
| 3: |
|
APP(f,a) |
→ APP(f,b) |
| 4: |
|
APP(g,b) |
→ APP(g,a) |
|
The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.
Tyrolean Termination Tool (0.01 seconds)
--- May 3, 2006